True quantified Boolean formula - PDFSEARCH.IO - Document Search Engine

True quantified Boolean formula
Results: 47

#	Item
21	Symmetry in Gardens of Eden Christiaan Hartman Marijn J. H. Heule∗ Delft University of Technology Add to Reading List Source URL: www.cs.utexas.edu Language: English - Date: 2014-01-02 11:31:27 Boolean algebra Symmetry Logic in computer science NP-complete problems Electronic design automation Boolean satisfiability problem True quantified Boolean formula Conjunctive normal form Symmetry in mathematics Theoretical computer science Mathematics Applied mathematics
22	Efficient Extraction of Skolem Functions from QRAT Proofs Marijn J.H. Heule Martina Seidl and Armin Biere Add to Reading List Source URL: www.cs.utexas.edu Language: English - Date: 2014-07-31 09:58:16 Model theory Automated theorem proving Boolean algebra Metalogic First-order logic Function True quantified Boolean formula Skolem normal form Resolution Mathematics Logic Mathematical logic
23	DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs Nathan Wetzler, Marijn J. H. Heule, and Warren A. Hunt, Jr. ? Add to Reading List Source URL: www.cs.utexas.edu Language: English - Date: 2014-04-02 18:01:43 Automated theorem proving Formal methods NP-complete problems Constraint programming Logic in computer science True quantified Boolean formula Resolution Satisfiability Modulo Theories Unsatisfiable core Theoretical computer science Mathematics Logic
24	A Unified Proof System for QBF Preprocessing? Marijn J.H. Heule1 , Martina Seidl2 , and Armin Biere2 1 Department of Computer Science, The University of Texas at Austin, USA [removed] Add to Reading List Source URL: www.cs.utexas.edu Language: English - Date: 2014-07-31 09:57:45 Automated theorem proving Boolean algebra Mathematical logic Resolution True quantified Boolean formula Conjunctive normal form Limit Literal Model theory Mathematics Logic Theoretical computer science
25	The Nondeterministic Constraint Logic Model of Computation: Reductions and Applications Robert A. Hearn1 and Erik D. Demaine2 1 Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Add to Reading List Source URL: groups.csail.mit.edu Language: English - Date: 2002-07-31 20:05:58 Complexity classes Logic gates Finite model theory Boolean algebra True quantified Boolean formula Flip-flop PSPACE-complete FO IP Theoretical computer science Computational complexity theory Applied mathematics
26	Space and energy efficient computation with DNA strand displacement systems Chris Thachuk and Anne Condon Department of Computer Science, University of British Columbia, Vancouver, BC, Canada Abstract. Chemical reaction Add to Reading List Source URL: www.cs.ubc.ca Language: English - Date: 2012-06-17 22:22:27 Complexity classes True quantified Boolean formula NL Reversible computing PSPACE-complete PP DSPACE IP Computation Theoretical computer science Computational complexity theory Applied mathematics
27	Formal Methods Group ETH Zurich ¨ June 2003 Armin Biere, Cyrille Artho, Malek Haroud, Viktor Schuppan Computer Systems Institute ETH Zurich, Add to Reading List Source URL: fmics.inria.fr Language: English - Date: 2003-06-27 09:56:55 Cantons of Switzerland Model checking Boolean satisfiability problem ETH Zurich Røros Formal methods True quantified Boolean formula Zurich Theoretical computer science Boolean algebra Mathematics
28	Efficiently Solving Quantified Bit-Vector Formulas Christoph M. Wintersteiger Youssef Hamadi Leonardo de Moura Add to Reading List Source URL: www.winterstiger.at Language: English - Date: 2010-07-29 11:34:28 Model theory Predicate logic Electronic design automation Logic in computer science NP-complete problems Satisfiability Modulo Theories Boolean satisfiability problem True quantified Boolean formula Skolem normal form Logic Theoretical computer science Mathematical logic
29	DISS. ETH NO[removed]Termination Analysis for Bit-Vector Programs A dissertation submitted to ETH ZURICH for the degree of Add to Reading List Source URL: www.winterstiger.at Language: English - Date: 2011-11-25 16:39:55 Boolean algebra True quantified Boolean formula
30	A First Step Towards a Unified Proof Checker for QBF Toni Jussila1 , Armin Biere1 , Carsten Sinz2 , Daniel Kr¨ oning3 , and Christoph M. Wintersteiger3 1 Add to Reading List Source URL: www.winterstiger.at Language: English - Date: 2008-01-30 18:21:35 Automated theorem proving Complexity classes Boolean algebra Model theory True quantified Boolean formula Predicate logic Resolution Skolem normal form FO Theoretical computer science Mathematics Mathematical logic